Discrete Autocorrelation-Based Multiplicative MRAs and Sampling on ℝ

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete autocorrelation-based multiplicative MRAs and sampling on R

GivenK > 0 and a positive integerM, the function△K,M (t) = Kmax(1− |t| M , 0) represents an isosceles triangle on the real line R having height K and base 2M. For a given K and M, a constant amplitude sequence is constructed on the integers Z having autocorrelation △K,M restricted to Z. With this setup, a large class of bounded sequences z is shown to exist, where the autocorrelation of z is a ...

متن کامل

C*-algebras on r-discrete Abelian Groupoids

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...

متن کامل

Nonparametric Estimation for Lévy Models Based on Discrete-Sampling

A Lévy model combines a Brownian motion with drift and a purejump homogeneous process such as a compound Poisson process. The estimation of the Lévy density, the infinite-dimensional parameter controlling the jump dynamics of the process, is studied under a discrete-sampling scheme. In that case, the jumps are latent variables whose statistical properties can in principle be assessed when the f...

متن کامل

Column Sampling Based Discrete Supervised Hashing

By leveraging semantic (label) information, supervised hashing has demonstrated better accuracy than unsupervised hashing in many real applications. Because the hashing-code learning problem is essentially a discrete optimization problem which is hard to solve, most existing supervised hashing methods try to solve a relaxed continuous optimization problem by dropping the discrete constraints. H...

متن کامل

Invariant functions for solving multiplicative discrete and continuous ordinary differential equations

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sampling Theory, Signal Processing, and Data Analysis

سال: 2011

ISSN: 2730-5716,2730-5724

DOI: 10.1007/bf03549537